W ork BRICS Basic Research in Computer Science Open Maps ( at ) Work
نویسندگان
چکیده
The notion of bisimilarity, as defined by Park and Milner, has turned out to be one of the most fundamental notions of operational equivalences in the field of process algebras. Not only does it induce a congruence (largest bisimulation) in CCS which have nice equational properties, it has also proven itself applicable for numerous models of parallel computation and settings such as Petri Nets and semantics of functional languages. In an attempt to understand the relationships and differences between the extensive amount of research within the field, Joyal, Nielsen, and Winskel recently presented an abstract categorytheoretic definition of bisimulation. They identify spans of morphisms satisfying certain “path lifting” properties, so-called open maps, as a possible abstract definition of bisimilarity. In [JNW93] they show, that they can capture Park and Milner’s bisimulation. The aim of this paper is to show that the abstract definition of bisimilarity is applicable “in practice” by showing how a representative selection of well-known bisimulations and equivalences, such as e.g. Hennessy’s testing equivalence, Milner and Sangiorgi’s barbed bisimulation, and Larsen and Skou’s probabilistic bisimulation, are captured in the setting of open maps and hence, that the proposed notion of open maps seems successful. Hence, we confirm that the treatment of strong bisimulation in [JNW93] is not a one-off application of open maps.
منابع مشابه
A Representation Result for Free Cocompletions
Given a class F of weights, one can consider the construction that takes a small category C to the free cocompletion of C under weighted colimits, for which the weight lies in F . Provided these free F cocompletions are small, this construction generates a 2-monad on Cat, or more generally on V-Cat for monoidal biclosed complete and cocomplete V. We develop the notion of a dense 2-monad on V-Ca...
متن کاملHashing Functions can Simplify Zero- Knowledge Protocol Design (too)
In Crypto93, Damg̊ard showed that any constant-round protocol in which the verifier sends only independent, random bits and which is zero-knowledge against the honest verifier can be transformed into a protocol (for the same problem) that is zero-knowledge in general. His transformation was based on the interactive hashing technique of Naor, Ostrovsky, Venkatesan and Yung, and thus the resulting...
متن کاملNegative Dependence Through the FKG Inequality
We investigate random variables arising in occupancy problems, and show the variables to be negatively associated, that is, negatively dependent in a strong sense. Our proofs are based on the FKG correlation inequality, and they suggest a useful, general technique for proving negative dependence among random variables. We also show that in the special case of two binary random variables, the no...
متن کاملHonest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs
This paper presents two transformations of public-coin/Arthur-Merlin proof systems which are zero-knowledge with respect to the honest verifier into (public-coin/ArthurMerlin) proof systems which are zero-knowledge with respect to any verifier. The first transformation applies only to constant-round proof systems. It builds on Damgård’s transformation (see Crypto93), using ordinary hashing func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996